翻訳と辞書 Words near each other ・ Reducto da Salga ・ Reductoderces araneosa ・ Reductoderces aucklandica ・ Reductoderces cawthronella ・ Reductoderces fuscoflava ・ Reductoderces illustris ・ Reductoderces microphanes ・ Reductoniscus costulatus ・ Reducz ・ Redueña ・ Reduit ・ Reduit (disambiguation) ・ Reduncinae ・ Redundancy ・ Redundancy (engineering) ・ Redundancy (information theory) ・ Redundancy (linguistics) ・ Redundancy in United Kingdom law ・ Redundancy Payments Act 1965 ・ Redundancy problem ・ Redundancy theory of truth ・ Redundant (play) ・ Redundant (song) ・ Redundant array of independent memory ・ Redundant Array of Inexpensive Servers ・ Redundant binary representation ・ Redundant church ・ Redundant code ・ Redundant proof ・ Reduplicated plural Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Redundancy (information theory) ： ウィキペディア英語版 Redundancy (information theory) Redundancy in information theory is the number of bits used to transmit a message minus the number of bits of actual information in the message. Informally, it is the amount of wasted "space" used to transmit certain data. Data compression is a way to reduce or eliminate unwanted redundancy, while checksums are a way of adding desired redundancy for purposes of error detection when communicating over a noisy channel of limited capacity. ==Quantitative definition== In describing the redundancy of raw data, the rate of a source of information is the average entropy per symbol. For memoryless sources, this is merely the entropy of each symbol, while, in the most general case of a stochastic process, it is :$r\; =\; \backslash lim\_\; \backslash frac\; H(M\_1,\; M\_2,\; \backslash dots\; M\_n),$ the limit, as ''n'' goes to infinity, of the joint entropy of the first ''n'' symbols divided by ''n''. It is common in information theory to speak of the "rate" or "entropy" of a language. This is appropriate, for example, when the source of information is English prose. The rate of a memoryless source is simply $H(M)$, since by definition there is no interdependence of the successive messages of a memoryless source. The absolute rate of a language or source is simply :$R\; =\; \backslash log\; |\backslash mathbb\; M|\; ,\backslash ,$ the logarithm of the cardinality of the message space, or alphabet. (This formula is sometimes called the Hartley function.) This is the maximum possible rate of information that can be transmitted with that alphabet. (The logarithm should be taken to a base appropriate for the unit of measurement in use.) The absolute rate is equal to the actual rate if the source is memoryless and has a uniform distribution. The absolute redundancy can then be defined as :$D\; =\; R\; -\; r\; ,\backslash ,$ the difference between the absolute rate and the rate. The quantity $\backslash frac\; D\; R$ is called the relative redundancy and gives the maximum possible data compression ratio, when expressed as the percentage by which a file size can be decreased. (When expressed as a ratio of original file size to compressed file size, the quantity $R\; :\; r$ gives the maximum compression ratio that can be achieved.) Complementary to the concept of relative redundancy is efficiency, defined as $\backslash frac\; r\; R\; ,$ so that $\backslash frac\; r\; R\; +\; \backslash frac\; D\; R\; =\; 1$. A memoryless source with a uniform distribution has zero redundancy (and thus 100% efficiency), and cannot be compressed. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Redundancy (information theory)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.